Composition and refinement of specifications and parameterised data types
نویسندگان
چکیده
In [5] we introduced a framework for specification of parameterized data types utilizing a generalization of the traditional semantics based on the pushout construction. In the present paper, we address the issue of program development using this framework with particular emphasis on the notion of refinement. Unlike for the loose specifications, refinement does not amount merely to a narrowing of the model class, but primarily to introduction of additional structure into the specified program. We give examples based on the analogues of the classical vertical and horizontal composition of such specifications.
منابع مشابه
Specifications of Software Architectures using Diagrams of Constructions
Formal methods promise the ultimate quality of software artifacts with mathematical proof of their correctness. Algebraic specification is one of such methods, providing formal specifications of system components suitable for verification of correctness of all individual steps in the software development process, and hence of the entire development process and of the resulting program. In this ...
متن کاملModel-Checking of Specifications Integrating Processes, Data and Time
We present a new model-checking technique for CSP-OZ-DC, a combination of CSP, Object-Z and Duration Calculus, that allows reasoning about systems exhibiting communication, data and real-time aspects. As intermediate layer we will use a new kind of timed automata that preserve events and data variables of the specification. These automata have a simple operational semantics that is amenable to ...
متن کاملLoose semantics in the verification of communicating systems
The specification language CSP-CASL combines algebraic and process algebraic formalisms for the description of reactive systems with structured data [Rog 03]. We are using this formalism to formally specify and verify a Swiss banking system and its communication protocol. The EP2 banking system describes the actors involved in an electronic payment and the interfaces between them [EP2]. The so-...
متن کاملA Calculus for Predicative Programming
A calculus for developing programs from specifications written as predicates that describe the relationship between the initial and final state is proposed. Such specifications are well known from the specification language Z. All elements of a simple sequential programming notation are defined in terms of predicates. Hence programs form a subset of specifications. In particular, sequential com...
متن کاملParameterised Linearisability
Many concurrent libraries are parameterised, meaning that they implement generic algorithms that take another library as a parameter. In such cases, the standard way of stating the correctness of concurrent libraries via linearisability is inapplicable. We generalise linearisability to parameterised libraries and investigate subtle trade-offs between the assumptions that such libraries can make...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 70 شماره
صفحات -
تاریخ انتشار 2002